Scheduling controllable processing time jobs in a deteriorating environment
نویسندگان
چکیده
منابع مشابه
Scheduling Resumable Deteriorating Jobs
We consider the following single-machine time-dependent scheduling problem with constraints on the machine availability. There is given a set of independent and deteriorating jobs Jj , 1 ≤ j ≤ n, to be processed on a single machine, starting from time t0 > 0. The processing time pj of job Jj is a proportional function of the starting time Sj of this job, pj = αjSj, where Sj ≥ t0 and deteriorati...
متن کاملScheduling Jobs with Values Exponentially Deteriorating over Time in a Job Shop Environment
This study focuses on solving a special kind of job shop scheduling problem (JSP), where the job value is exponentially deteriorating over time. The current study attempted to find out whether the expected benefits of Lot Streaming (LS) can be found in solving the JSP with the objective of maximizing the total value of the jobs. LS is a process of splitting jobs into smaller sub-jobs such that ...
متن کاملScheduling Deteriorating Jobs on a Single Processor
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملA Hybrid Approach for Fuzzy Just-In-Time Flow Shop Scheduling with Limited Buffers and Deteriorating Jobs
This paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. The fuzzy set theory is applied to describe this situation. A novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. Due to the computational complexities, the prop...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operational Research Society
سال: 2014
ISSN: 0160-5682,1476-9360
DOI: 10.1057/jors.2013.5